On the Asymptotic Range of Cocyclesfor Shifts of Finite
نویسنده
چکیده
We study the problem of lifting ergodicity to certain skew-product extensions over shifts of nite type. This can be done by computing the asymptotic range of the deening cocycle. For a class of ergodic shift-invariant measures and a class of functions (deening conservative extensions) we give a characterisation of ergodicity in terms of weights of periodic orbits in the shift space.
منابع مشابه
Asymptotic Distributions of Estimators of Eigenvalues and Eigenfunctions in Functional Data
Functional data analysis is a relatively new and rapidly growing area of statistics. This is partly due to technological advancements which have made it possible to generate new types of data that are in the form of curves. Because the data are functions, they lie in function spaces, which are of infinite dimension. To analyse functional data, one way, which is widely used, is to employ princip...
متن کاملA remark on asymptotic enumeration of highest weights in tensor powers of a representation
We consider the semigroup $S$ of highest weights appearing in tensor powers $V^{otimes k}$ of a finite dimensional representation $V$ of a connected reductive group. We describe the cone generated by $S$ as the cone over the weight polytope of $V$ intersected with the positive Weyl chamber. From this we get a description for the asymptotic of the number of highest weights appearing in $V^{otime...
متن کاملAsymptotic Behaviors of Nearest Neighbor Kernel Density Estimator in Left-truncated Data
Kernel density estimators are the basic tools for density estimation in non-parametric statistics. The k-nearest neighbor kernel estimators represent a special form of kernel density estimators, in which the bandwidth is varied depending on the location of the sample points. In this paper, we initially introduce the k-nearest neighbor kernel density estimator in the random left-truncatio...
متن کاملAsymptotic algorithm for computing the sample variance of interval data
The problem of the sample variance computation for epistemic inter-val-valued data is, in general, NP-hard. Therefore, known efficient algorithms for computing variance require strong restrictions on admissible intervals like the no-subset property or heavy limitations on the number of possible intersections between intervals. A new asymptotic algorithm for computing the upper bound of the samp...
متن کاملAsymptotic Analysis of Binary Gas Mixture Separation by Nanometric Tubular Ceramic Membranes: Cocurrent and Countercurrent Flow Patterns
Analytical gas-permeation models for predicting the separation process across membranes (exit compositions and area requirement) constitutes an important and necessary step in understanding the overall performance of membrane modules. But, the exact (numerical) solution methods suffer from the complexity of the solution. Therefore, solutions of nonlinear ordinary differential equations th...
متن کامل